An Ordering Genetic Algorithm for Assembly Planning
نویسندگان
چکیده
Assembly sequence planning (ASP) aims to find an optimal sequence to assemble a product. We propose here to use the ordering genetic algorithms (OGA) to solve this problem. The approach is based on three main ideas. Firstly, the identification of the subassemblies in the sequence is done by keeping trace of the components membership to a set of parts all along the sequence. Secondly, precedence constraints are satisfied by an univocal transformation of the studied sequence into a valid one, thanks to “precedence values” changing through the sequence. Finally the evaluation of each sequence is realized thanks to a multi-criteria decision-aid method called Promethee II. The use of such a method avoids the aggregation of several technical criteria into a unique fitness value, and lets us compares the individuals of the population one to each other.
منابع مشابه
The Comparison of Imperialist Competitive Algorithm Applied and Genetic Algorithm for Machining Allocation of Clutch Assembly (TECHNICAL NOTE)
The allocation of design tolerances between the components of a mechanical assembly and manufacturing tolerances can significantly affect the functionality of products and related production costs. This paper introduces Imperialist Competitive Algorithm (ICA) approach to solve the machining tolerance allocation of an overrunning clutch assembly. The objective is to obtain optimum tolerances of...
متن کاملA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملAn Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm
This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...
متن کاملA multiple objective approach for joint ordering and pricing planning problem with stochastic lead times
The integration of marketing and demand with logistics and inventories (supply side of companies) may cause multiple improvements; it can revolutionize the management of the revenue of rental companies, hotels, and airlines. In this paper, we develop a multi-objective pricing-inventory model for a retailer. Maximizing the retailer's profit and the service level are the objectives, and shorta...
متن کاملOptimisation of assembly scheduling in VCIM systems using genetic algorithm
Assembly plays an important role in any production system as it constitutes a significant portion of the lead time and cost of a product. Virtual computer-integrated manufacturing (VCIM) system is a modern production system being conceptually developed to extend the application of traditional computer-integrated manufacturing (CIM) system to global level. Assembly scheduling in VCIM systems is ...
متن کاملمدل ریاضی مساله زمانبندی و برنامهریزی پیشرفته: مورد کاوی شرکت مانپلاستیک
In this paper, a mixed integer programming model for Advanced Planning and Scheduling has been presented and implemented in Mann Plastic Company with the objective of minimizing cost of tardiness and earliness of an order. The proposed mathematical model considers capacity constraints, operation sequence, due date in multi order environment and outsourcing. In order to solve the mathematical ...
متن کامل